On an n-dimensional quadratic spline approximation
نویسندگان
چکیده
منابع مشابه
Best Quadratic Spline Approximation
We present a method for hierarchical data approximation using quadratic simplicial elements for domain decomposition and field approximation. Higher-order simplicial elements can approximate data better than linear elements. Thus, fewer quadratic elements are required to achieve similar approximation quality. We use quadratic basis functions and compute best quadratic simplicial spline approxim...
متن کاملAsymptotic Approximation by Quadratic Spline Curves
For a planar curve C with positive affine curvature, we derive an asymptotic formula for the area approximation by quadratic spline curves with n knots lying on C. The order of approximation is 1/n4 and the formula depends on an integral over the affine curvature. 1991 AMS subject classification: 52A10, 53A04, 53A15, 41A15, 41A50
متن کاملAn Improved N-dimensional NURBs-based Metamodel
Non Uniform Rational B-splines (NURBs) are proved to be very promising for metamodeling in engineering problems, because they have unique properties such as local modification scheme, strong convex hull property, and infinitely differentiability, etc. Since NURBs are defined by control points, knot vector, and weights associated with control points, the precision of NURBs is influenced by all o...
متن کاملOn Curved Simplicial Elements and Best Quadratic Spline Approximation for Hierarchical Data Representation
We present a method for hierarchical data approximation using curved quadratic simplicial elements for domain decomposition. Scientific data defined over twoor three-dimensional domains typically contain boundaries and discontinuities that are to be preserved and approximated well for data analysis and visualization. Curved simplicial elements make possible a better representation of curved geo...
متن کاملQuadratic Spline Quasi - Interpolants on Bounded Domains
We study some C1 quadratic spline quasi-interpolants on bounded domains ⊂ Rd, d = 1, 2, 3. These operators are of the form Q f (x) = ∑ k∈K () μk( f )Bk(x), where K () is the set of indices of B-splines Bk whose support is included in the domain and μk( f ) is a discrete linear functional based on values of f in a neighbourhood of xk ∈ supp(Bk). The data points x j are vertices of a unifor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Approximation Theory
سال: 1992
ISSN: 0021-9045
DOI: 10.1016/0021-9045(92)90088-6